﻿#include"RBTree.h"


void TestBRTree1()
{
    BRTree<int, int> t;
    // 常规的测试⽤例

   int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
        // 
   //特殊的带有双旋场景的测试⽤例

   // int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
    for (auto e : a)
    {
        t.insert({ e, e });
    }
    t.InOrder();
    cout << t.IsBalance() << endl;
}

int main()
{
    TestBRTree1();

	return 0;
}